Sphere Packing and Zero-Rate Bounds to the Reliability of Classical-Quantum Channels

نویسنده

  • Marco Dalai
چکیده

In this paper, the sphere packing bound of Fano, Shannon, Gallager and Berlekamp and the zero-rate bound of Berlekamp are extended to general classical-quantum channels. The upper bound for the reliability function obtained from the sphere packing coincides at high rates, for the case of pure state channels, with a lower bound derived by Burnashev and Holevo [21]. Thus, for pure state channels, the reliability function at high rates is now exactly determined. For the general case, the obtained upper bound expression at high rates was conjectured to represent also a lower bound to the reliability function, but a complete proof has not been obtained yet. Finally, the obtained zero-rate upper bound to the reliability function of a general classical-quantum channel with no zero-error capacity coincides with a lower bound obtained by Holevo, thus determining the exact expression.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Sphere-Packing Bounds with Polynomial Prefactors

We study lower bounds on the optimal error probability in classical coding over classicalquantum channels at rates below the capacity, commonly termed quantum sphere-packing bounds. Winter and Dalai have derived such bounds for classical-quantum channels; however, the exponents in their bounds only coincide when the channel is classical. In this paper, we show that these two exponents admit a v...

متن کامل

Beyond I . I . D . in Information Theory Arriving Sunday

S (in alphabetic order by speaker surname) Speaker: Mario Berta (Caltech) Title: Relative entropies of recovery and conditional quantum mutual information Abstract: Fawzi and Renner (arXiv:1410.0664) recently established a lower bound on the conditional quantum mutual information (CQMI) of tripartite quantum states ⇢ABC in terms of the fidelity of recovery (FoR), i.e. the maximal fidelity of th...

متن کامل

How to beat the sphere-packing bound with feedback

The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless feedback is allowed from the decoder to the encoder. To beat the bound, the problem must be changed. While it has long been known that variable-length block codes can do better when trading-off error probability with e...

متن کامل

Some Remarks on Classical and Classical-Quantum Sphere Packing Bounds: Rényi vs. Kullback-Leibler

We review the use of binary hypothesis testing for the derivation of the sphere packing bound in channel coding, pointing out a key difference between the classical and the classical-quantum setting. In the first case, two ways of using the binary hypothesis testing are known, which lead to the same bound written in different analytical expressions. The first method historically compares output...

متن کامل

Little Green Codes: Energy-Efficient Short-Range Communication

A green code attempts to minimize the total energy per-bit required to communicate across a noisy channel. The classical information-theoretic approach neglects the energy expended in processing the data at the encoder and the decoder and only minimizes the energy required for transmissions. Since there is no cost associated with using more degrees of freedom, the traditionally optimal strategy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1201.5411  شماره 

صفحات  -

تاریخ انتشار 2012